Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
501	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:22 NP-complete problems Operations research Approximation algorithm Travelling salesman problem APX Steiner tree problem Algorithm Set cover problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
502	Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:46 NP-complete problems Graph coloring Edge coloring Independent set Dominating set Combinatorial optimization Search algorithms Maximal independent set Minimum spanning tree Graph theory Theoretical computer science Mathematics
503	Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices Ioannis Koutis1 , Alex Levin2 , and Richard Peng3 1 Computer Science Department, University of Puerto Rico, Río Piedras Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2012-02-13 21:14:04 Analysis of algorithms NP-complete problems Probabilistic complexity theory Randomized algorithm Minor SL Degree Graph partition Time complexity Theoretical computer science Graph theory Computational complexity theory
504	FEEDBACK FORM We welcome comments/views/suggestions from visitors to our website. If you would like to comment please complete feedback form and email to: or post to PO Box 1596, Ilford, Essex IG Add to Reading List Source URL: www.supportline.org.uk Language: English - Date: 2007-11-07 14:08:09 Email Electronics Science Technology Control theory Feedback IG postcode area
505	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ George W. Hart† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:07:19 NP-complete problems Combinatorial optimization Graph connectivity Matching Steiner tree problem Minimum spanning tree Eulerian path Route inspection problem Cut Graph theory Theoretical computer science Mathematics
506	Space and energy efficient computation with DNA strand displacement systems Chris Thachuk and Anne Condon Department of Computer Science, University of British Columbia, Vancouver, BC, Canada Abstract. Chemical reaction Add to Reading List Source URL: www-devel.cs.ubc.ca Language: English - Date: 2012-06-17 22:22:27 Complexity classes True quantified Boolean formula NL Reversible computing PSPACE-complete PP DSPACE IP Computation Theoretical computer science Computational complexity theory Applied mathematics
507	Constraints DOIs10601The Complexity of Reasoning with Global Constraints Christian Bessiere · Emmanuel Hebrard · Brahim Hnich · Toby Walsh Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:29 Applied mathematics Mathematical optimization Local consistency Constraint satisfaction NP-complete Computational complexity theory P versus NP problem NP Complexity of constraint satisfaction Constraint programming Theoretical computer science Complexity classes
508	CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Network theory Routing algorithms Planar separator theorem Shortest path problem Distance Induced path Tree NP-complete problems Path decomposition Graph theory Mathematics Theoretical computer science
509	When Trees Grow Low: Shrubs and Fast MSO1 Robert Ganian1 , Petr Hlinˇen´ y2 , Jaroslav Neˇsetˇril3 , Jan Obdrˇz´alek2 , Patrice Ossona de Mendez4 , and Reshma Ramadurai2 1 Add to Reading List Source URL: www.fi.muni.cz Language: English - Date: 2012-06-17 02:27:41 NP-complete problems Cograph Tree decomposition Clique Graph Tree Minor Cycle rank Path decomposition Graph theory Graph operations Graph coloring
510	Parameterized Algorithms for Graph Partitioning Problems Hadas Shachnai and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {hadas,meizeh}@cs.technion.ac.il Abstract. We study a broad class of Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:35:59 NP-complete problems Combinatorial optimization Dynamic programming Mathematical optimization Operations research Optimal control Connectivity Tree decomposition Parameterized complexity Theoretical computer science Graph theory Mathematics

UPDATE